A Family of 2 - process Mutual Exclusion AlgorithmsNotes
نویسنده
چکیده
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Family of 2-process Mutual Exclusion Algorithms
In Peterson [1981], Peterson suggested a mutual exclusion algorithm. The algorithm, though simple in structure, seems quite involved when a formal proof is attempted. We suggest how Peterson’s algorithm and some similar algorithms may be derived by starting with a highlevel algorithm and refining it. The refinement consists of implementing a complex shared data structure by elementary data stru...
متن کاملCorrectness Proofs of the Peterson - Fischer Mutual Exclusion Algorithms
The Peterson-Fischer 2-process mutual exclusion algorithm [PF] is introduced in a slightly modified form. An invariant-assertional proof of mutual exclusion is presented for the 2-process algorithm. Next, the Peterson-Fischer n-process mutual exclusion algorithm is introduced conceptually as a tournament of [lg n] 2-process competitions. A mutual-exclusion proof of the n-process algorithm is pr...
متن کاملA Proof of Burns N - Process Mutual ExclusionAlgorithm using
Within the Input/Output Automata framework, we state and prove a general abstraction theorem giving conditions for preservation of safety properties from one automaton to another. We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisses the mutual exclusion property. The concrete n-process algorithm is abstrac...
متن کاملSpeeding Lamport's Fast Mutual Exclusion Algorithm
A linked list is used to speed up a mutual exclusion algorithm. This optimization permits additional concurrency by allowing scans of the list to be concurrent with insertions and deletions of list entries.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994